On a conjecture of Brouwer involving the connectivity of strongly regular graphs

نویسندگان

  • Sebastian M. Cioaba
  • Kijung Kim
  • Jacobus H. Koolen
چکیده

In this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum number of vertices of a strongly regular graph whose removal disconnects the graph into non-singleton components. We show that strongly regular graphs constructed from copolar spaces and from the more general spaces called ∆-spaces are counterexamples to Brouwer’s Conjecture. Using J.I. Hall’s characterization of finite reduced copolar spaces, we find that the triangular graphs T (m), the symplectic graphs Sp(2r, q) over the field Fq (for any q prime power), and the strongly regular graphs constructed from the hyperbolic quadrics O+(2r, 2) and from the elliptic quadrics O(2r, 2) over the field F2, respectively, are counterexamples to Brouwer’s Conjecture. For each of these graphs, we determine precisely the minimum number of vertices whose removal disconnects the graph into non-singleton components. While we are not aware of an analogue of Hall’s characterization theorem for ∆-spaces, we show that complements of the point graphs of certain finite generalized quadrangles are point graphs of ∆-spaces and thus, yield other counterexamples to Brouwer’s Conjecture. We prove that Brouwer’s Conjecture is true for many families of strongly regular graphs including the conference graphs, the generalized quadrangles GQ(q, q) graphs, the lattice graphs, the Latin square graphs, the strongly regular graphs with smallest eigenvalue −2 (except the triangular graphs) and the primitive strongly regular graphs with at most 30 vertices except for few cases. We leave as an open problem determining the best general lower bound for the minimum size of a disconnecting set of vertices of a strongly regular graph, whose removal disconnects the graph into non-singleton components. E-mail addresses: [email protected] (S.M. Cioabă), [email protected] (K. Kim) and [email protected] (J.H. Koolen) Department of Mathematical Sciences, University of Delaware, Newark, DE 19707-2553, USA Department of Mathematics, Pusan National University, Busan 609-735, South Korea Department of Mathematics, POSTECH, Pohang 790-785, South Korea

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on Fouquet-Vanherpe’s question and Fulkerson conjecture

‎The excessive index of a bridgeless cubic graph $G$ is the least integer $k$‎, ‎such that $G$ can be covered by $k$ perfect matchings‎. ‎An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless‎ ‎cubic graph has excessive index at most five‎. ‎Clearly‎, ‎Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5‎, ‎so Fouquet and Vanherpe as...

متن کامل

CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

متن کامل

Algebraic Graph Theory

Simeon Ball, Universitat Politécnica de Catalunya On subsets of a finite vector space in which every subset of basis size is a basis In this talk we consider sets of vectors S of the vector space Fq with the property that every subset of S of size k is a basis. The classical example of such a set is the following. Example (Normal Rational Curve) The set S = {(1, t, t, . . . , tk−1) | t ∈ Fq} ∪ ...

متن کامل

The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters

We prove a conjecture by Van Dam & Sotirov on the smallest eigenvalue of (distance-j) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-j) Johnson graphs. More generally, we study the smallest eigenvalue and the second largest eigenvalue in absolute value of the graphs of the relations of classical P and Q-polynomial association schemes.

متن کامل

er 10 82 ON A FAMILY OF STRONGLY REGULAR GRAPHS WITH λ = 1 ANDRIY

In this paper, we give a complete description of strongly regular graphs with parameters ((n + 3n − 1), n(n + 3), 1, n(n + 1)). All possible such graphs are: the lattice graph L3,3 with parameters (9, 4, 1, 2), the Brouwer-Haemers graph with parameters (81, 20, 1, 6), and the Games graph with parameters (729, 112, 1, 20).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 119  شماره 

صفحات  -

تاریخ انتشار 2012